Semidefinite programming, harmonic analysis and coding theory

نویسنده

Christine Bachoc

چکیده

These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics. CONTENTS

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 5 Se p 20 09 SEMIDEFINITE PROGRAMMING , HARMONIC ANALYSIS AND CODING THEORY

These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics. CONTENTS

متن کامل

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

متن کامل

Semidefinite programming in combinatorial optimization

We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovfisz theta function and its applications to stable sets, perfect graphs, and coding theory. (it) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the embedding of finite metric spaces and its relatio...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Semidefinite Programming for Dynamic Steady-State Analysis of Structures under Uncertain Harmonic Loads

This paper presents semidefinite programming approaches for computing confidential bounds for the dynamic steady-state responses of a damped structure subjected to uncertain driving loads. We assume that amplitudes of harmonic driving loads obey a non-probabilistic uncertainty model. The semidefinite programming problems are formulated for finding confidential bounds for various characteristic ...

متن کامل